Information cascade, Kirman’s ant colony model, and kinetic Ising model
نویسندگان
چکیده
منابع مشابه
Information cascade, Kirman¬タルs ant colony model, and kinetic Ising model
In this paper, we discuss a voting model in which voters can obtain information from a finite number of previous voters. There exist three groups of voters: (i) digital herders and independent voters, (ii) analog herders and independent voters, and (iii) tanh-type herders. In our previous paper Hisakado andMori (2011), we used themean field approximation for case (i). In that study, if the refe...
متن کاملResource leveling scheduling by an ant colony-based model
In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...
متن کاملModel Checking the Ant Colony Optimisation
We present a model for the travelling salesman problem (TSP) solved using the ant colony optimisation (ACO), a bio-inspired mechanism that helps speed up the search for a solution and that can be applied to many other problems. The natural complexity of the TSP combined with the selforganisation and emergent behaviours that result from the application of the ACO make model-checking this system ...
متن کاملAnt Colony Optimization in Model Checking
Most of model checkers found in the literature use exact deterministic algorithms to check the properties. The memory required for the verification with these algorithms usually grows in an exponential way with the size of the system to verify. When the search for errors with a low amount of computational resources (memory and time) is a priority (for example, in the first stages of the impleme...
متن کاملAnt Colony Optimization for Model Checking
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of model checkers found in the literature use exact deterministic algorithms to check the properties. These algorithms usually require huge amounts of computational resources if the checked model is large. We propose here the use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2015
ISSN: 0378-4371
DOI: 10.1016/j.physa.2014.09.008